Embedding Taxonomical, Situational or Sequential Knowledge Graph Context for Recommendation Tasks
نویسندگان
چکیده
Learned latent vector representations are key to the success of many recommender systems in recent years. However, traditional approaches like matrix factorization produce that capture global distributions a static recommendation scenario only. Such user or item do not background knowledge and customized concrete situational context sequential history events leading up it. This is fundamentally limiting restriction for tasks applications, since state can depend on a) abstract information, b) current c) related observations. An illustrating example restaurant scenario, where user’s assessment situation depends taxonomical information regarding type cuisine, factors time day, weather location subjective individual experience this preceding situations. situation-specific internal captured when using collaborative filtering approach, knowledge, nature an individual’s cannot easily be represented matrix. In paper, we investigate how well state-of-the-art exploit those different dimensions relevant POI tasks. Naturally, represent such as temporal graph compare plain graph, taxonomy hypergraph embedding recurrent neural network architecture context-dimensions rich information. Our empirical evidence indicates most crucial prediction performance, while harder exploit. they still have their specific merits depending situation.
منابع مشابه
Context-Dependent Knowledge Graph Embedding
We consider the problem of embedding knowledge graphs (KGs) into continuous vector spaces. Existing methods can only deal with explicit relationships within each triple, i.e., local connectivity patterns, but cannot handle implicit relationships across different triples, i.e., contextual connectivity patterns. This paper proposes context-dependent KG embedding, a twostage scheme that takes into...
متن کاملSafe Medicine Recommendation via Medical Knowledge Graph Embedding
Most of the existing medicine recommendation systems that are mainly based on electronic medical records (EMRs) are significantly assisting doctors to make better clinical decisions benefiting both patients and caregivers. Even though the growth of EMRs is at a lighting fast speed in the era of big data, content limitations in EMRs restrain the existed recommendation systems to reflect relevant...
متن کاملSemantically Smooth Knowledge Graph Embedding
This paper considers the problem of embedding Knowledge Graphs (KGs) consisting of entities and relations into lowdimensional vector spaces. Most of the existing methods perform this task based solely on observed facts. The only requirement is that the learned embeddings should be compatible within each individual fact. In this paper, aiming at further discovering the intrinsic geometric struct...
متن کاملProjE: Embedding Projection for Knowledge Graph Completion
With the large volume of new information created every day, determining the validity of information in a knowledge graph and filling in its missing parts are crucial tasks for many researchers and practitioners. To address this challenge, a number of knowledge graph completion methods have been developed using low-dimensional graph embeddings. Although researchers continue to improve these mode...
متن کاملLocally Adaptive Translation for Knowledge Graph Embedding
Knowledge graph embedding aims to represent entities and relations in a large-scale knowledge graph as elements in a continuous vector space. Existing methods, e.g., TransE and TransH, learn embedding representation by defining a global margin-based loss function over the data. However, the optimal loss function is determined during experiments whose parameters are examined among a closed set o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studies on the semantic web
سال: 2021
ISSN: ['1868-1158']
DOI: https://doi.org/10.3233/ssw210046